Complexity-penalized estimation of minimum volume sets for dependent data

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum volume semialgebraic sets for robust estimation

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this problem is not tractable, even though it becomes convex e.g. when restricted to nonnegative homogeneous polynomials. Our contribution is to describe and justi...

متن کامل

Learning Minimum Volume Sets

Given a probability measure P and a reference measure μ, one is often interested in the minimum μ-measure set with P -measure at least α. Minimum volume sets of this type summarize the regions of greatest probability mass of P , and are useful for detecting anomalies and constructing confidence regions. This paper addresses the problem of estimating minimum volume sets based on independent samp...

متن کامل

Minimum complexity density estimation

The minimum complexity or minimum description-length criterion developed by Kolmogorov, Rissanen, Wallace, So&in, and others leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity. A related issue is the compromise between accuracy of approximations and complexity relative to the sample size. An i...

متن کامل

Multiscale Likelihood Analysis and Complexity Penalized Estimation

We describe here a framework for a certain class of multiscale likelihood factorizations wherein, in analogy to a wavelet decomposition of an L function, a given likelihood function has an alternative representation as a product of conditional densities reflecting information in both the data and the parameter vector localized in position and scale. The framework is developed as a set of suffic...

متن کامل

Minimum complexity regression estimation with weakly dependent observations

The minimum complexity regression estimation framework, due to Andrew Barron, is a general data-driven methodology for estimating a regression function from a given list of parametric models using independent and identically distributed (i.i.d.) observations. We extend Barron’s regression estimationframework tom-dependent observations and to stronglymixing observations. In particular, we propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 2010

ISSN: 0047-259X

DOI: 10.1016/j.jmva.2010.04.009